Reliable and High-Speed KASUMI Block Cipher by Residue Number System Code
نویسنده
چکیده
Third generation cellular network technology (3G) can revolutionize communications and data exchanges between many people in a more overwhelming fashion than 2G and 2.5G networks did. The 3G UMTS, the 3G GSM and the 3G GPRS rely on the KASUMI block cipher. Therefore, increasing speed, decreasing power consumption and error detection/correction are the major concerns of the KASUMI algorithm and its generation. On the other hand, Residue Number System is a non-weighted number system and it is currently considered as an important method for high-speed, low-power, parallel and carry-free arithmetic realizations. Redundant Residue Number System is an extension of RNS that also supports error detection and correction. Multi-Level Residue Number System uses the new Residue Number System for each modulo, so the speed of operations is increased because of decreasing modulo. In this paper we synthesize these numeric systems and use “Multi-Level Redundant Residue Number System” for increasing speed and reliability of the KASUMI. This system also supports high error detection and correction capabilities. Moreover, One-Hot Residue Number System is a high performance technique in which the propagation delay of this implementation is just one transistor. In this document we also utilize “One-Hot Multi-Level Residue Number System” in the KASUMI block cipher to achieve more optimizations in terms of delay, power consumption, hardware and lastly power delay product.
منابع مشابه
Small and High-Speed Hardware Architectures for the 3GPP Standard Cipher KASUMI
Abstract. The KASUMI block cipher and the confidentiality (f8) and integrity (f9) algorithms using KASUMI in feed back cipher modes have been standardized by the 3GPP. We designed compact and high-speed implementations and then compared several prototypes to existing designs in ASICs and FPGAs. Making good use of the nested structure of KASUMI, a lot of function blocks are shared and reused. Th...
متن کاملGreen Cryptanalysis: Meet-in-the-Middle Key-Recovery for the Full KASUMI Cipher
KASUMI is a block cipher with eight Feistel rounds and a key of up to 128 bits. Proposed more than 10 years ago, the confidentiality and integrity of 3G mobile communications systems depend on the security of KASUMI. In the practically interesting single key setting that we are aiming for in this work, no attack is known. For the full 8-round KASUMI we show for the first time a wide variety of ...
متن کاملKey classification attack on block ciphers
In this paper, security analysis of block ciphers with key length greater than block length is proposed. When key length is significantly greater than block length and the statistical distribution of cipher system is like a uniform distribution, there are more than one key which map fixed input to fixed output. If a block cipher designed sufficiently random, it is expected that the key space ca...
متن کاملProvable Security of KASUMI and 3GPP Encryption Mode f8
Within the security architecture of the 3GPP system there is a standardised encryption mode f8 based on the block cipher KASUMI. In this work we examine the pseudorandomness of the block cipher KASUMI and the provable security of f8. First we show that the three round KASUMI is not a pseudorandom permutation ensemble but the four round KASUMI is a pseudorandom permutation ensemble under the ada...
متن کاملDesign Principles of the KASUMI Block Cipher
In this paper, we discuss some of theory of provable security against differential and linear cryptanalysis. We also review the design principles of the block cipher KASUMI—especially its resistance against the basic forms of linear and differential cryptanalysis.
متن کامل